Complete theory - PDFSEARCH.IO - Document Search Engine

Complete theory
Results: 1780

#	Item
761	arXiv:1304.7456v1 [cs.DS] 28 AprCounting Hypergraphs in Data Streams He Sun Max Planck Institute for Informatics Saarbr¨ Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2013-05-03 12:26:04 Hypergraph NP-complete problems Graph Packing in a hypergraph Orbifold Graph theory Theoretical computer science Mathematics
762	Crawling Deep Web Using a New Set Covering Algorithm Yan Wang1 , Jianguo Lu12 , and Jessica Chen1 1 2 Add to Reading List Source URL: jlu.myweb.cs.uwindsor.ca Language: English - Date: 2009-10-20 21:31:39 NP-complete problems Greedy algorithm Matroid theory Information retrieval Algorithm Invisible Web Set cover problem Mathematics Combinatorics Applied mathematics
763	Approximate Computation and Implicit Regularization for Very Large-scale Data Analysis Michael W. Mahoney Department of Mathematics Stanford University Stanford, CA 94305 Add to Reading List Source URL: www.cs.yale.edu Language: English - Date: 2012-05-21 20:27:46 Linear algebra NP-complete problems Matrix theory Computational complexity theory Graph partition Approximation algorithm Algorithm Graph theory Eigenvalues and eigenvectors Mathematics Algebra Theoretical computer science
764	Questions Answered. In Theory. http://cstheory.stackexchange.com∗ Perhaps you’re a computer scientist wondering how much the Axiom of Choice matters to the theorems you study and prove[21]. Perhaps you’re a mathema Add to Reading List Source URL: www.cs.utah.edu Language: English - Date: 2010-11-05 18:41:12 Complexity classes Community websites Mathematical optimization Conjectures P versus NP problem Structural complexity theory Stack Exchange Network NP-complete NP Theoretical computer science Computational complexity theory Applied mathematics
765	On Set Intersection Representations of Graphs ∗ S. Jukna †‡ Abstract The intersection dimension of a bipartite graph with respect to a type L is the smallest number t for which it is possible to assign sets Ax ⊆ Add to Reading List Source URL: lovelace.thi.informatik.uni-frankfurt.de Language: English - Date: 2008-10-14 11:56:16 Bipartite graph Parity Clique Matching Adjacency matrix Intersection graph Complete bipartite graph Graph Bipartite dimension Graph theory Mathematics NP-complete problems
766	On the construction of convergent transfer subgraphs in general labeled directed graphs 38th CGTC 7 March 2007 Add to Reading List Source URL: contrapunctus.net Language: English - Date: 2012-03-13 13:00:13 Automata theory Finite-state machine Vertex Tree Graph NP-complete problems Directed acyclic graph Ancestral graph Graph theory Theoretical computer science Mathematics
767	Journal of Automated Reasoning manuscript No. (will be inserted by the editor) PSpace Tableau Algorithms for Acyclic Modalized ALC Jia Tao · Giora Slutzki · Vasant Honavar Add to Reading List Source URL: www.cs.iastate.edu Language: English - Date: 2011-06-14 00:05:06 Model theory Philosophical logic Automated theorem proving Method of analytic tableaux Abox Structure Boolean satisfiability problem PSPACE-complete Modal logic Theoretical computer science Mathematical logic Mathematics
768	MSc projects at BT Research Keith Briggs keithbriggs.info Add to Reading List Source URL: keithbriggs.info Language: English - Date: 2007-01-26 05:46:17 Graph coloring NP-complete problems Semidefinite programming Clique Lovász number Edge coloring Graph Clique problem Graph theory Mathematics Theoretical computer science
769	Adaptive Greedy Approximations1 Georey Davis Mathematics Department, Dartmouth College Hanover, NHStephane Mallat, Marco Avellaneda Add to Reading List Source URL: www.geoffdavis.net Language: English NP-complete problems Complexity classes Combinatorial optimization Approximation algorithm NP Set cover problem Reduction Matching pursuit Matching Theoretical computer science Computational complexity theory Applied mathematics
770	Motivation COMS21103 NP-completeness Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-01-08 09:09:08 Complexity classes NP-complete NP-hard P versus NP problem NP Cook–Levin theorem Boolean satisfiability problem PP P Theoretical computer science Computational complexity theory Applied mathematics

UPDATE